Robustness of noisy quantum networks
نویسندگان
چکیده
Quantum networks are a new paradigm of complex networks, allowing us to harness networked quantum technologies and develop internet. But how robust is network when its links nodes start failing? We show that based on typical noisy quantum-repeater prone discontinuous phase transitions with respect the random loss operating nodes, abruptly compromising connectivity network, thus significantly limiting reach operation. Furthermore, we determine critical efficiency necessary avoid this catastrophic as function topology, size, distribution entanglement in network. In particular, our results indicate scale-free topology crucial design principle establish large-scale
منابع مشابه
Improving Mention Detection Robustness to Noisy Input
Information-extraction (IE) research typically focuses on clean-text inputs. However, an IE engine serving real applications yields many false alarms due to less-well-formed input. For example, IE in a multilingual broadcast processing system has to deal with inaccurate automatic transcription and translation. The resulting presence of non-target-language text in this case, and non-language mat...
متن کاملNoisy quantum Parrondo games
Alternating two fair coin flipping games can create a winning game. Such a Parrondo game is a discrete model for a thermal ratchet. Recently we have constructed quantum versions of these coin flipping games that display the same “paradoxical” behavior. In this paper we add noise to these quantum Parrondo games in order that they can be compared with continuum models of quantum ratchets. Simulat...
متن کاملNonclassicality of noisy quantum states
Nonclassicality conditions for an oscillator-like system interacting with a hot thermal bath are considered. Nonclassical properties of quantum states can be conserved up to a certain temperature threshold only. In this case affection of the thermal noise can be compensated via transformation of an observable, which tests the nonclassicality (witness function). Possibilities for experimental im...
متن کاملRobustness of adiabatic quantum computation
The method of quantum computation by adiabatic evolution has been proposed as a general way of solving combinatorial search problems on a quantum computer [1]. Whereas a conventional quantum algorithm is implemented as a sequence of discrete unitary transformations that form a quantum circuit involving many energy levels of the computer, the adiabatic algorithm works by keeping the state of the...
متن کاملClassical robustness of quantum unravellings
– We introduce three measures which quantify the degree to which quantum systems possess the robustness exhibited by classical systems when subjected to continuous observation. Using these we show that for a fixed environmental interaction the level of robustness depends on the measurement strategy, or unravelling, and that no single strategy is maximally robust in all ways. When describing the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications physics
سال: 2022
ISSN: ['2399-3650']
DOI: https://doi.org/10.1038/s42005-022-00866-7